Parallel Transformation of Bounding Volume Hierarchies into Oriented Bounding Box Trees
نویسندگان
چکیده
Oriented bounding box (OBB) hierarchies can be used instead of based on axis-aligned boxes (AABB), providing tighter fitting to the underlying geometric structures and resulting in improved interference tests, such as ray-geometry intersections. In this paper, we present a method for fast, parallel transformation an existing volume hierarchy (BVH), AABBs, into oriented boxes. To end, parallelise high-quality OBB extraction algorithm from literature operate standalone estimator further extend it efficiently build bottom up manner. This agglomerative approach allows fast execution formation arbitrary, OBBs hierarchies. The is fully implemented GPU extensively evaluated with ray
منابع مشابه
Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-trees and box-trees.
متن کاملRasterized Bounding Volume Hierarchies
We present the rasterized bounding volume hierarchy (RBVH), a compact data structure that accelerates approximate ray casting of complex meshes and provides adjustable level of detail. During construction, we identify subtrees of BVHs containing surfaces that can be represented by height fields. For these subtrees the conventional ray-surface intersection, which possibly involves a large number...
متن کاملIntroduction to bounding volume hierarchies
This paper is an excerpt from Chapter 1 of my PhD thesis [Hav04], written to introduce my publications about bounding volume hierachies [Aga02, Arg04, Hav04BG]. 1 Computational geometry and geometric data structures Computational geometry is the area of algorithms research that deals with computations on geometric objects. Examples of such objects are points, lines and polygons in the plane—whi...
متن کاملBounding Volume Hierarchies of Slab Cut Balls
We introduce a bounding volume hierarchy based on the Slab Cut Ball. This novel type of enclosing volume provides an attractive balance between tightness of fit, cost of overlap testing, and memory requirement. The hierarchy construction algorithm includes a new method for the construction of tight bounding volumes in worst case O(n) time, which means our tree data structure is constructed in O...
متن کاملCache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cache parameters or block sizes of the memory hierarchy. We introduce a new probabilistic model to predict the runtime access patterns of a BVH. Our layout computation algorithm utilizes parent-child and spatial localitie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2023
ISSN: ['1467-8659', '0167-7055']
DOI: https://doi.org/10.1111/cgf.14758